mcsta

Benchmark
Model:dpm v.2 (MA)
Parameter(s)N = 4, C = 8, TIME_BOUND = 5
Property:PmaxQueuesFullBound (prob-reach-time-bounded)
Invocation (default)
mcsta/modest mcsta dpm.jani -E N=4,C=8,TIME_BOUND=5 --props PmaxQueuesFullBound -O out.txt Minimal --unsafe --es -S Memory --no-partial-results --width 1e-3 --relative-width
Execution
Walltime:76.84921026229858s
Return code:0
Relative Error:0.0
Log
dpm.jani:model: info: dpm is an MA model.
dpm.jani: info: Need 16 bytes per state.
dpm.jani: info: Explored 356426 states for N=4, C=8, TIME_BOUND=5.0.
dpm.jani: info: Identified 356417 maximal end components.

Peak memory usage: 190 MB
Analysis results for dpm.jani
Experiment N=4, C=8, TIME_BOUND=5.0

+ State space exploration
  State size:  16 bytes
  States:      356426
  Transitions: 418842
  Branches:    681242
  Rate:        415415 states/s
  Time:        0.9 s

+ Property PmaxQueuesFullBound
  Probability: 2.2335263360845845E-08
  Bounds:      [2.2316392539366227E-08, 2.2354134182325462E-08]
  Time:        75.4 s

  + Precomputations
    Max. prob. 0 states:          0
    Time for max. prob. 0 states: 0.0 s

  + End components
    Iterations:  2
    MECs:        356417
    Transitions: 418833
    Branches:    681233
    Time:        0.3 s

  + Essential states
    Iterations:       2
    Essential states: 123138
    Transitions:      185554
    Branches:         447954
    Time:             0.1 s

  + Unif+
    Time:                           75.0 s
    Max. exit rate:                 4.1
    Iterations (lower bound):       6
    Final unif. rate (lower bound): 65.6
    Iterations (upper bound):       5
    Final unif. rate (upper bound): 32.8

Exported results to file "/out.txt".	
STDERR
The Modest Toolset (www.modestchecker.net), version v3.1.42-gb5e9d523c.